منابع مشابه
Boolean Compilation of Relational Specifications
A new method for analyzing relational specifications is described. A property to be checked is cast as a relational formula, which, if the property holds, has no finite models. The relational formula is translated into a boolean formula that has a model for every model of the relational formula within some finite scope. Errors in specifications can usually be demonstrated with small counterexam...
متن کاملBoolean Valued Models and Incomplete Specifications
Logic programming has favored universal Horn theories for several reasons. An advantage of consistent universal Horn theories, compared with arbitrary consistent theories, is the fact that they possess a “typical” model-the least Herbrand model. More precisely, in order to verify that a sentence of the form 3 X, . . . 3 x, A, where A is a conjunction of atomic formulas (i.e. positive literals),...
متن کاملLearning Commutativity Specifications
In this work we present a new sampling-based “black box” inference approach for learning the behaviors of a library component. As an application, we focus on the problem of automatically learning commutativity specifications of data structures. This is a very challenging problem, yet important, as commutativity specifications are fundamental to program analysis, concurrency control and even low...
متن کاملA New Test Data Selection Strategy for Tesing Boolean Specifications
Software testing plays an important role in the process of software development. Usually, exhaustive testing is infeasible because the number of possible test cases is typically prohibitively large. Much research has been aimed at simultaneously achieving high efficacy and reduced cost of testing by selecting appropriate test cases. In this note, we discuss testing of an implementation intended...
متن کاملGenerating minimal fault detecting test suites for general Boolean specifications
Context: Boolean expressions are a central aspect of speci cations and programs, but they also o er dangerously many ways to introduce faults. To counter this e ect, various criteria to generate and evaluate tests have been proposed. These are traditionally based on the structure of the expressions, but are not directly related to the possible faults. Often, they also require expressions to be ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2015
ISSN: 0004-3702
DOI: 10.1016/j.artint.2015.09.003